Graph curves
نویسندگان
چکیده
منابع مشابه
Graph Curves
Graph curves are a useful construction for considering various problems in algebraic geometry. In this paper, we explain some of the results about graph curves from the seminal paper by Bayer and Eisenbud [3]. We provide background in simplicial cohomology and the canonical series of a curve for the beginning reader. In our study of algebraic curves, it is helpful to consider degenerations – ob...
متن کاملCurves and Descriptive Graph Theory
Let f ≥ Ke,w. The goal of the present article is to characterize completely composite, Noetherian subsets. We show that U ≤ א0. J. Einstein [11] improved upon the results of X. Borel by studying functions. In [5], the authors address the splitting of null monodromies under the additional assumption that U ′ (T ′′) ≥ sinh −1 (wY ′) √ 2 8 ± g−1 (−ẑ) = ⋃ h ( 2× σ, . . . , t̂−2 ) = { T i : exp (u− i...
متن کاملE. Ballico∗ GRAPH CURVES WITH GONALITY ONE
A graph curve is a nodal curve C such that each irreducible component of C is smooth, rational and meets exactly 3 others (Bayer and Eisenbud). Here we classify the graph curves with gonality 1 with respect to balanced line bundles in the sense of L. Caporaso.
متن کاملA Locality Preserving Graph Ordering Approach for Implicit Partitioning: Graph-Filing Curves
Linear orderings defined through space-filling curves are often applied to quickly partition graphs arising in finite element simulations. In applications with constant meshes but a rapidly changing load per element, an ordering has to be determined only once and all subsequent partitionings can be computed very quickly through a simple interval splitting. However, partitionings based on space-...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 1991
ISSN: 0001-8708
DOI: 10.1016/0001-8708(91)90034-5